recursive descent parsers造句

LL grammars can also be parsed by recursive descent parsers.
This idea can be used to generate a recursive descent parser for formulas.
A " predictive parser " is a recursive descent parser that does not require backtracking.
It is rather easy for students to write a recursive descent parser for such a simple syntax.
A variant of the AA compiler included run-time support for a top-down recursive descent parser.
It's difficult to find recursive descent parsers in a sentence. 用recursive descent parsers造句挺难的

The Tcl library is a hybrid BNF-style definition of a recursive descent parser via sub-rules.
In computer science, a "'recursive descent parser "'is a kind of grammar.
So recursive ascent parsers are generally slower, less obvious, and harder to hand-modify than recursive descent parsers.
This article is about the formal properties of LL grammars; for parsing, see LL parser or recursive descent parser.
Perl 6 sandwiches an operator-precedence parser between two Recursive descent parsers in order to achieve a balance of speed and dynamism.
It assumes that the " primary " nonterminal is parsed in a separate subroutine, like in a recursive descent parser.
By contrast, Hamilton uses a top-down recursive descent parser that allows it to compile commands and procedures to an internal form before running them.
A TDPL grammar can be viewed as an extremely minimalistic formal representation of a recursive descent parser, in which each of the nonterminals schematically represents a parsing function.
Apart from providing the constructs for grammar definition parboiled implements a complete recursive descent parser with support for abstract syntax tree construction, parse error reporting and parse error recovery.
LL grammars can alternatively be characterized as precisely those that can be parsed by a predictive parser a recursive descent parser without backtracking and these can be readily written by hand.

更多例句：下一页